Block Algorithms for FFTs on Vector and Parallel Computers

نویسنده

  • Markus Hegland
چکیده

This work is part of a joint project of ANU and Fujitsu Ltd. Japan for the development of vector and parallel numerical algorithms and software. The results will be included in the Fujitsu Scientiic Subroutine Library. Coding and testing is done in cooperation with

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

FFTs in External or Hierarchical

Conventional algorithms for computing large one-dimensional fast Fourier transforms (FFTs), even those algorithms recently developed for vector and parallel computers, are largely unsuitable for systems with external or hierarchical memory. The principal reason for this is the fact that most FFT algorithms require at least m complete passes through the data set to compute a 2 m-point FFT. This ...

متن کامل

Parallel Spatial Pyramid Match Kernel Algorithm for Object Recognition using a Cluster of Computers

This paper parallelizes the spatial pyramid match kernel (SPK) implementation. SPK is one of the most usable kernel methods, along with support vector machine classifier, with high accuracy in object recognition. MATLAB parallel computing toolbox has been used to parallelize SPK. In this implementation, MATLAB Message Passing Interface (MPI) functions and features included in the toolbox help u...

متن کامل

On Some Block Algorithms for Fast Fourier Transforms

Since the publication of the Cooley-Tukey algorithm a variety of related algorithms for fast Fourier transforms have been suggested by Gentleman/Sande, Stockham, Pease, Johnson/Burrus and others. These algorithms diier mainly in the way they store and access their data. From a numerical point of view, they use splitting which is related to a factorization of the complex Fourier transform matrix...

متن کامل

A Self-sorting In-place Fast Fourier Transform Algorithm Suitable for Vector and Parallel Processing

We propose a new algorithm for fast Fourier transforms. This algorithm features uniformly long vector lengths and stride one data access. Thus it is well adapted to modern vector computers like the Fujitsu VP2200 having several oating point pipelines per CPU and very fast stride one data access. It also has favorable properties for distributed memory computers as all communication is gathered t...

متن کامل

Multiprocessor FFTs

Several multiprocessor FFTs are developed in this paper for both vector multiprocessors with shared memory and the hypercube. Two FFTs for vector multiprocessors are given that compute an ordered transform and have a stride of one except for a single "link" step. Since multiple FFTs provide additional options for both vectorization and distribution we show that a single FFT can be performed in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993